Succinct description of regular languages by weak restarting automata

(In)Dependencies in Functional Generative Description by Restarting Automata

We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...

Functional Generative Description, Restarting Automata and Analysis by Reduction

Functional Generative Description (FGD is a dependency based system for Czech, whose beginnings date back to the 1960s (see esp. Sgall et al. 1969, Sgall et al. 1986). FGD may be of some interest for the description of most Slavic languages, since it is adapted to treat a high degree of free word order. It not only specifies surface structures of the given sentences, but also translates them in...

Regular Languages and Finite Automata

Regular Languages and Finite Automata

In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying the behavior of the nervous systems. Following up on the ideas of McCulloch and Pitts, Kleene [3] wrote the first paper on finite automata and regular expressions. A finite automaton can be considered as the simplest machine model in that the machine has a finite memory; that is, the memory size is independent ...

Weak $\omega$-Regular Trace Languages

Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are “linearizations” of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the latter. In this vein, our contribution is twofold. Firstly, we develop definitions that allow classification of ω-regular trace languages in terms of the correspo...